| 翻訳と辞書 |
| Clique percolation method ： ウィキペディア英語版 |
Clique percolation method
The clique percolation method〔(Uncovering the overlapping community structure of complex networks in nature and society ) G. Palla, I. Derényi, I. Farkas, and T. Vicsek: ''Nature'' 435, 814–818 (2005)〕 is a popular approach for analyzing the overlapping community structure of networks. The term ''network community'' (also called a module, cluster or cohesive group)
has no widely accepted unique definition and it is usually defined as a group of nodes that are more densely connected to each other than to other nodes in the network. There are numerous alternative methods for detecting communities in networks,〔(Community detection in graphs ) by S. Fortunato, ''Physics Reports'' 486, 75-174 (2010)〕 for example, the Girvan–Newman algorithm, hierarchical clustering and modularity maximization.
==Definitions==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Clique percolation method」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|